On the Distributed Decision-Making Complexity of the Minimum Vertex Cover Problem
نویسندگان
چکیده
In this paper we study the problem of computing approximate vertex covers of a graph on the basis of partial information in the distributed decision-making model proposed by Deng and Papadimitriou 1]. In particular, we show an optimal algorithm whose competitive ratio is equal to p, where p is the number of processors.
منابع مشابه
Minimum Vertex Cover, Distributed Decision-Making, and Communication Complexity (Extended Abstract)
In this paper we study the problem of computing approximate vertex covers of a graph on the basis of partial information and we consider the distributed decision-making and the communication complexity frameworks. In the rst framework we do not allow communication among the processors: in this case, we show an optimal algorithm whose performance ratio is equal to p where p is the number of proc...
متن کاملApproximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
For a given graph G over n vertices, let OPT G denote the size of an optimal solution in G of a particular minimization problem (e.g., the size of a minimum vertex cover). A randomized algorithm will be called an α-approximation algorithm with an additive error for this minimization problem, if for any given additive error parameter > 0 it computes a value ÕPT such that, with probability at lea...
متن کاملOn Approximating the Minimum Vertex Cover in Sublinear Time and the Connection to Distributed Algorithms
We consider the problem of estimating the size, V C(G), of a minimum vertex cover of a graph G, in sublinear time, by querying the incidence relation of the graph. We say that an algorithm is an (α, )approximation algorithm if it outputs with high probability an estimate V̂ C such that V C(G) − n ≤ V̂ C ≤ α · V C(G) + n, where n is the number of vertices of G. We show that the query complexity of...
متن کاملApproximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs
In this paper, two distributed algorithms for the minimum vertex cover problem are given. In the unweighted case, we propose a 2.5-approximation algorithm with round complexity O(∆), where ∆ is the maximal degree of G, improving the previous 3-approximation result with the same round complexity O(∆). For the weighted case, we give a 4-approximation algorithm with round complexity O(∆).
متن کاملDistributed Vertex Cover in Network Graphs
Vertex cover, a minimal set of nodes to cover all edges in a graph, is an abstraction of coverage problems in sensor networks, transportation networks, etc, and is a well-konwn NP-hard problem. Minimum weighted vertex cover (MWVC) problem asks for further minimizing the cumulative weight of a vertex cover. We present new distributed k-hop algorithms for MWVC problem with theoretical and practic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- ITA
دوره 30 شماره
صفحات -
تاریخ انتشار 1996